Existential Assertions for Voting Protocols
نویسندگان
چکیده
In [22], we extend the Dolev-Yao model with assertions. We build on that work and add existential abstraction to the language, which allows us to translate common constructs used in voting protocols into proof properties. We also give an equivalencebased definition of anonymity in this model, and prove anonymity for the FOO voting protocol.
منابع مشابه
Election verifiability in electronic voting protocols (Preliminary version)
We present a symbolic definition of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifiability. It also allows us to dete...
متن کاملTowards Automatic Analysis of Election Verifiability Properties
We present a symbolic definition that captures some cases of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the software tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifi...
متن کاملPrimitive recursive selection functions for existential assertions over abstract algebras
We generalize to abstract many-sorted algebras the classical proof-theoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃yP (x, y) (where P is Σ01), provable in Peano arithmetic withΣ 1 induction, has a primitive recursive selection function. This involves a corresponding generalization to such algebras of the notion of primitive recursiveness . The main difficulty encountere...
متن کاملAssertions for the Tcl Language
Assertions, even as simple as the C assert macro, o er important self-checking properties to programs, and improve the robustness of software when they are used. This paper describes AsserTcl, an assertion package for the Tcl programming language. Our assertions take the form of commands in the program text, and cover point assertions about the computation state, assertions about procedure inpu...
متن کاملProgramming and Verifying Subgame Perfect Mechanisms
An extension of the WHILE-language is developed for programming game-theoretic mechanisms involving multiple agents. Examples of such mechanisms include auctions, voting procedures, and negotiation protocols. A structured operational semantics is provided in terms of extensive games of almost perfect information. Hoare-style partial correctness assertions are proposed to reason about the correc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017